Proof of a Conjectured Three-Valued Family of Weil Sums of Binomials

We consider Weil sums of binomials of the form WF,d(a) = ∑ x∈F ψ(x d − ax), where F is a finite field, ψ : F → C is the canonical additive character, gcd(d, |F|) = 1, and a ∈ F. If we fix F and d and examine the values of WF,d(a) as a runs through F , we always obtain at least three distinct values unless d is degenerate (a power of the characteristic of F modulo F). Choices of F and d for which we obtain only three values are quite rare and desirable in a wide variety of applications. We show that if F is a field of order 3 with n odd, and d = 3 + 2 with 4r ≡ 1 (mod n), then WF,d(a) assumes only the three values 0 and ±3. This proves the 2001 conjecture of Dobbertin, Helleseth, Kumar, and Martinsen. The proof employs diverse methods involving trilinear forms, counting points on curves via multiplicative character sums, divisibility properties of Gauss sums, and graph theory.